Description: 1. 最早截止时间优先EDF（Earliest DeadlineFirst）算法是非常著名的实时调度算法之一。在每一个新的就绪状态，调度器都是从那些已就绪但还没有完全处理完毕的任务中选择最早截止时间的任务，并将执行该任务所需的资源分配给它。在有新任务到来时，调度器必须立即计算EDF，排出新的定序，即正在运行的任务被剥夺，并且按照新任务的截止时间决定是否调度该新任务。如果新任务的最后期限早于被中断的当前任务，就立即处理新任务。按照EDF算法，被中断任务的处理将在稍后继续进行。
-1. The first priority deadline for EDF (Earliest DeadlineFirst) algorithm is a very famous one in real-time scheduling algorithm. In every state of readiness for a new, scheduler from those already in place but has not fully dealt with the mandate to select the earliest deadline for the task, and the implementation of the tasks required for the allocation of resources to it. In the arrival of new tasks, the scheduler must immediately calculate EDF, from the new sequencing, that is the task of running was curtailed, and new tasks in accordance with the deadline for deciding whether to dispatch the new tasks. If the new mission as early as the deadline for the immediate task was interrupted immediately to deal with new tasks. In accordance with the EDF algorithm, the task was interrupted to deal with will be at a later date to continue. Platform: |
Size: 2048 |
Author:wjx |
Hits:
Description: An important class of scheduling algorithms is the class of dynamic priority algorithms. The most important dynamic priority algorithm is Earliest Deadline First (EDF).
Earliest-deadline-first (EDF) is good for scheduling real-time tasks in order to meet timing constraint. Earliest-deadline-first (EDF) is real-time disk-scheduling algorithms that service realtime tasks according to their deadlines.
EDF was originally designed for processor scheduling. When applied to disks, the algorithm simply selects the request with the earliest deadline for service. An advantage of this algorithm is that it is simple and easy to implement. Performance results demonstrate the effectiveness of the algorithm.
- An important class of scheduling algorithms is the class of dynamic priority algorithms. The most important dynamic priority algorithm is Earliest Deadline First (EDF).
Earliest-deadline-first (EDF) is good for scheduling real-time tasks in order to meet timing constraint. Earliest-deadline-first (EDF) is real-time disk-scheduling algorithms that service realtime tasks according to their deadlines.
EDF was originally designed for processor scheduling. When applied to disks, the algorithm simply selects the request with the earliest deadline for service. An advantage of this algorithm is that it is simple and easy to implement. Performance results demonstrate the effectiveness of the algorithm.
Platform: |
Size: 43008 |
Author:vss |
Hits:
Search - earliest deadline